Discrimination of attractors with noisy nodes in Boolean networks

Observing the internal state of whole system using a small number sensor nodes is important in analysis complex networks. Here, we study problem determining minimum to discriminate attractors under assumption that each attractor has at most K noisy nodes. We present exact and approximation algorithms for this minimization problem. The effectiveness also demonstrated by computational experiments both synthetic data realistic biological data.